On the least square-free primitive root modulo p
نویسندگان
چکیده
منابع مشابه
On the least prime primitive root modulo a prime
We derive a conditional formula for the natural density E(q) of prime numbers p having its least prime primitive root equal to q, and compare theoretical results with the numerical evidence. 1. Theoretical result concerning the density of primes with a given least prime primitive root Let us denote, following Elliott and Murata [4], by g(p) and G(p) the least primitive and the least prime primi...
متن کاملA new prime p for which the least primitive root (modp) and the least primitive root (modp2) are not equal
With the aid of a computer network we have performed a search for primes p < 1012 and revealed a new prime p = 6692367337 for which its least primitive root (mod p) and its least primitive root (mod p2) are not equal.
متن کاملSquare Roots Modulo p
The algorithm of Tonelli and Shanks for computing square roots modulo a prime number is the most used, and probably the fastest among the known algorithms when averaged over all prime numbers. However, for some particular prime numbers, there are other algorithms which are considerably faster. In this paper we compare the algorithm of Tonelli and Shanks with an algorithm based in quadratic fiel...
متن کاملSquare-free orders for CM elliptic curves modulo p
Let E be an elliptic curve defined over Q, of conductor N , and with complex multiplication. We prove unconditional and conditional asymptotic formulae for the number of ordinary primes p ! N , p ≤ x , for which the group of points of the reduction of E modulo p has square-free order. These results are related to the problem of finding an asymptotic formula for the number of primes p for which ...
متن کاملLeast primitive root of prime numbers
Let p be a prime number. Fermat's little theorem [1] states that a^(p-1) mod p=1 (a hat (^) denotes exponentiation) for all integers a between 1 and p-1. A primitive root [1] of p is a number r such that any integer a between 1 and p-1 can be expressed by a=r^k mod p, with k a nonnegative integer smaller that p-1. If p is an odd prime number then r is a primitive root of p if and only if r^((p-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2017
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2016.06.011